Automated Program Checking via Action Planning
نویسندگان
چکیده
In this paper we translate concurrent C/C++ code into PDDL. The system then runs heuristic search planners against the PDDL outcome to generate traces for locating programming bugs. These counter-examples result in an interactive debugging aid and exploit efficient planner in-built heuristics. Different aspects like parsing, generation of the dependency graph, slicing, abstraction, and property conversion are described. For data abstraction we provide a library, and for increased usability the tool has been integrated in Eclipse.
منابع مشابه
Interleaving Execution and Planning via Symbolic Model Checking
Interleaving planning and execution is the practical alternative to the problem of planning off-line with large state spaces. While planning via symbolic model checking has been extensively studied for off-line planning, no framework for interleaving it with execution has been ever devised. In this paper, we extend planning via symbolic model checking with the ability of interleaving planning a...
متن کاملAgent planning programs
a r t i c l e i n f o a b s t r a c t Keywords: Agent-oriented programming Automated planning Reasoning about action and change Synthesis of reactive systems This work proposes a novel high-level paradigm, agent planning programs, for modeling agents behavior, which suitably mixes automated planning with agent-oriented programming. Agent planning programs are finite-state programs, possibly con...
متن کاملMIPS: The Model-Checking Integrated Planning System
sion diagrams (BDDs) to compactly represent world states in a planning problem and efficiently explore the underlying state space. It was the first general planning system based on model-checking methods. It can handle the STRIPS subset of the PDDL language and some additional features from ADL, namely, negative preconditions and (universal) conditional effects. At the Fifth International Confe...
متن کاملAgent Design Consistency Checking via Planning
In this work we present a novel approach to check the consistency of agent designs (prior to any implementation) with respect to the requirements specifications via automated planning. This checking is essentially a search problem which makes planning technology an appropriate solution. We focus our work on BDI agent systems and the Prometheus design methodology in order to directly compare our...
متن کاملSoftware Model Checking via Iterative Abstraction Refinement of Constraint Logic Queries
Existing predicate abstraction tools rely on both theorem provers (to abstract the original program) and model checkers (to check the abstract program). This paper combines these theorem proving and model checking components in a unified algorithm. The correctness of the original, infinite-state program is expressed as a single query in constraint logic, which is sufficiently expressive to enco...
متن کامل